Algorithmic Composition as a Constraint Satisfaction Problem
نویسنده
چکیده
Throughout the history, musicians have always used music composition rules, which actually are in most cases prohibitions or constraints. The elements of music with which composers work, as well as the possible combinations of those elements, make up a huge finite set of values. The composer’s function is to select, from this big set, a subset of values, which will be arranged into a certain temporal organization, constrained by the music rules, and eventually create an artistic work. From a mathematical point of view, this process is closely related to one field of Artificial Intelligence: Constraint Programming. In this paper the author makes a reflection on the relationship between Music Composition and Constraint Programming. As a concluding idea, the author suggests that Constraint Programming could be a promising technique for the development of computer systems oriented to algorithmic composition. This text follows after the lectures given by professor Dr. Héctor Geffner, in the doctoral course Problem Solving in Artificial Intelligence (2001-2002).
منابع مشابه
The Constraint Satisfaction Problem: Complexity and Approximability
During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, analysis, probability theory, graph theory, and combinatorics, have been used to analyze both the computational complexity and approximabilty of algorithmic tasks related to the constraint satisfaction problem (CSP), as well as the applicability/limitations o...
متن کاملConstraint Application with Higher-Order Programming for Modeling Music Theories
Modeling music theories with computer programs has attracted composers and scholars for a long time. On the one hand, the resulting programs can serve as algorithmic composition tools. On the other hand, such an approach leads to a better understanding of existing as well as newly developed theories, which in turn can lead to a better understanding of music, as well as to better ways to retriev...
متن کاملExploiting Problem Structure for Distributed Constraint Optimization
Distributed constraint optimization imposes considerable complexity in agents’ coordinated search for an optimal solution. However, in many application domains, problems often exhibit special structures that can be exploited to facilitate more efficient problem solving. One of the most recurrent structures involves disparity among subpmblems. We present a coordination mechanism, Anchor&Ascend, ...
متن کاملKernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems
In this paper, we present an algorithmic framework for kernelization of combinatorial problems posed as weighted constraint satisfaction problems (WCSPs). Our kernelization technique employs a polynomial-time maxflow-based algorithm to fix the optimal values of a subset of the variables in a preprocessing phase. It thereby reduces the set of variables for which exhaustive search is eventually r...
متن کاملImplementing Constraint Propagation by Composition of Reductions
Constraint propagation is a general algorithmic approach for pruning the search space of a constraint satisfaction problem. In a uniform way, K. R. Apt [1] has defined computation as an iteration of reduction functions over a domain. In [2], he has also demonstrated the need for integrating static properties of reduction functions (commutativity and semi-commutativity) to design specialized alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005